منابع مشابه
Linear Discriminant Analysis Algorithms
We propose new algorithms for computing linear discriminants to perform data dimensionality reduction from R to R, with p < n. We propose alternatives to the classical Fisher’s Distance criterion, namely, we investigate new criterions based on the: Chernoff-Distance, J-Divergence and Kullback-Leibler Divergence. The optimization problems that emerge of using these alternative criteria are non-c...
متن کاملNon-Linear Bit Arrangements in Genetic Algorithms
In earlier research we laid out a theoretical basis for the supposition that genetic algorithms can succeed even if bits are arranged in ways other than as a linear sequence. In the present paper we report on certain experiments that show such success can occur in practice. Our experiments consider cases in which bits are arranged in two-dimensional grids, in three-dimensional cubes, and as the...
متن کاملGenetic algorithms for linear feature extraction
Feature extraction is a commonly used technique applied before classification when a number of measures, or features, have been taken from a set of objects in a typical statistical pattern recognition task. The goal is to define a mapping from the original representation space into a new space where the classes are more easily separable. This will reduce the classifier complexity, increasing in...
متن کاملEvolving Evolutionary Algorithms Using Linear Genetic Programming
A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem and the Quadratic Assignment Problem are evolved by using the considered model...
متن کاملSimple Genetic Algorithms with Linear Fitness
A general form of stochastic search is described (random heuristic search) and some of its general properties are proved. This provides a framework in which the simple genetic algorithm (SGA) is a special case. The framework is used to illuminate relationships between seemingly diierent probabilistic perspectives of SGA behavior. Next, the SGA is formalized as an instance of random heuristic se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00004-8